Optimal Components Assignment Problem for Stochastic-Flow Networks
نویسندگان
چکیده
منابع مشابه
Optimal Assignment of a Two Types of Components in a Multi-state Stochastic-flow Network
A real-life system is usually modeled to be a network with edges and nodes for the performance evaluation. This paper devotes to finding out the optimal two-type component assignment with maximal system reliability, in which the components are separated to be two sets: one assigned to edges and the other set assigned to nodes. Each component should be multistate due to complete failure, partial...
متن کاملOptimal discounts for the online assignment problem
We prove that, for two simple functions drlt, solving the online assignment problem with crl − drlt as the contribution for assigning resource r to task l at time t gives the optimal solution to the corresponding offline assignment problem (provided the optimal offline solution is unique). We call such functions drlt optimal discount functions.
متن کاملA Geometric Assignment Problem for Robotic Networks
In this chapter we look at a geometric target assignment problem consisting of an equal number of mobile robotic agents and distinct target locations. Each agent has a fixed communication range, a maximum speed, and knowledge of every target’s position. The problem is to devise a distributed algorithm that allows the agents to divide the target locations among themselves and, simultaneously, le...
متن کاملA New Stochastic Algorithm For The Capacity & Flow Assignment Problem And An Associated Rate Of Convergence
In this paper we examine the problem of optimizing the average time latency of a network using agents that are able to learn. The network design is constrained by a traffic matrix which dedicates specific flows between specific pairs of nodes. Although this is an analysis of an application, we only present two methodologies here, i.e. an algorithm for optimization and a corresponding conservati...
متن کاملThe Stochastic Sequential Assignment Problem with Arrivals
We extend the classic sequential stochastic assignment problem to include arrivals of workers. When workers are all of the same type, we show that the socially optimal policy is the same as the individually optimal policy where workers are given priority according to LCFS. This result also holds under several variants in the model assumptions. When workers have different types, we show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2019
ISSN: 1549-3636
DOI: 10.3844/jcssp.2019.108.117